Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning
نویسنده
چکیده
Luca Trevisan [1] presented an approximation algorithm for Max Cut based on spectral partitioning techniques. He proved that the algorithm has an approximation ratio of at least 0.531. We improve this bound up to 0.6142. We also define and extend this result for the more general Maximum Colored Cut problem.
منابع مشابه
5 Conclusion
New spectral methods for ratio cut partitioning and clustering. A general purpose multi-way partitioning, Proc. We introduced a new natural metric, Via-Count, to better estimate inter-partition delays for evaluating partitioning solutions. We presented K-VIA-FM, an algorithm that iteratively improve solutions for the new metric. We compared the performance of K-VIA-FM with other algorithms, bot...
متن کاملCircuit Partitioning using High Level Design Information
2 PARTITIONING APPROACHES Partitioning digital circuits has become a key problem in the Computer Aided Engineering area during the last years. Design benefits of new technologies like MultiChip-Module designs or logic emulation strongly depends on partitioning results. Most published approaches are based on abstract graph models constructed from flat netlists, thus taking only connectivity info...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملA Study on the Relationship Mincut Circuit Partitioning
In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition I entropy on the V-E plain. If a circuit has higher initial potential / entropy, under a nearly max-cut reservation, we have higher probability to aim the mincut. The proposed new method is called Interleaved Cutting Edge-Node Interleaved Sort for Leaching and Envelop (...
متن کاملSpectral Clustering by Recursive Partitioning
In this paper, we analyze the second eigenvector technique of spectral partitioning on the planted partition random graph model, by constructing a recursive algorithm using the second eigenvectors in order to learn the planted partitions. The correctness of our algorithm is not based on the ratio-cut interpretation of the second eigenvector, but exploits instead the stability of the eigenvector...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 29 شماره
صفحات -
تاریخ انتشار 2015